Ela Optimal Subspaces and Constrained Principal Component Analysis
نویسندگان
چکیده
The main result of this article allows formulas of analytic geometry to be elegantly unified, by readily providing parametric as well as cartesian systems of equations. These systems characterize affine subspaces in Rp passing through specified affine subspaces of lower dimension. The problem solved is closely related to constrained principal component analysis. A few interesting applications are pointed out, notably a measure of the relative loss of optimality due to the constraints. The results pave the way for further research.
منابع مشابه
Gaussian Mixture Models with Component Means Constrained in Pre-selected Subspaces
We investigate a Gaussian mixture model (GMM) with component means constrained in a pre-selected subspace. Applications to classification and clustering are explored. An EM-type estimation algorithm is derived. We prove that the subspace containing the component means of a GMM with a common covariance matrix also contains the modes of the density and the class means. This motivates us to find a...
متن کاملMonte Carlo Algorithm for Least Dependent Non-Negative Mixture Decomposition
We propose a simulated annealing algorithm (stochastic non-negative independent component analysis, SNICA) for blind decomposition of linear mixtures of non-negative sources with non-negative coefficients. The demixing is based on a Metropolis-type Monte Carlo search for least dependent components, with the mutual information between recovered components as a cost function and their non-negativ...
متن کاملAlgebraic-Geometric and Probabilistic Approaches for Clustering and Dimension Reduction of Mixtures of Principle Component Subspaces ECE842 Course Project Report
Generalized Principal Component Analysis (GPCA) and Probabilistic Principal Component Analysis (PPCA) are two extensions of PCA approaches to the mixtures of principal subspaces. GPCA is an algebraic geometric framework in which the collection of linear subspaces is represented by a set of homogeneous polynomials whose degree corresponds to the number of subspaces and whose factors (roots) enco...
متن کاملBarycentric Subspaces and Affine Spans in Manifolds
This paper addresses the generalization of Principal Component Analysis (PCA) to Riemannian manifolds. Current methods like Principal Geodesic Analysis (PGA) and Geodesic PCA (GPCA) minimize the distance to a ”Geodesic subspace”. This allows to build sequences of nested subspaces which are consistent with a forward component analysis approach. However, these methods cannot be adapted to a backw...
متن کاملA Framework for 3D Object Recognition Using the Kernel Constrained Mutual Subspace Method
This paper introduces the kernel constrained mutual subspace method (KCMSM) and provides a new framework for 3D object recognition by applying it to multiple view images. KCMSM is a kernel method for classifying a set of patterns. An input pattern x is mapped into the high-dimensional feature space F via a nonlinear function φ, and the mapped pattern φ(x) is projected onto the kernel generalize...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003